Peterson's mutual exclusion algorithm revisited
نویسندگان
چکیده
منابع مشابه
Mutual exclusion revisited
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come firstserved algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris’s solution of the mutual exclusion with three weak semaphores. The presented algorithms compare favorably with equivalent published mu...
متن کاملWhen does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملSpeeding Lamport's Fast Mutual Exclusion Algorithm
A linked list is used to speed up a mutual exclusion algorithm. This optimization permits additional concurrency by allowing scans of the list to be concurrent with insertions and deletions of list entries.
متن کاملA Distributed K-Mutual Exclusion Algorithm
This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1997
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00003-8